Regular language

Results: 1038



#Item
991Foma: a finite-state compiler and library Mans Hulden University of Arizona

Foma: a finite-state compiler and library Mans Hulden University of Arizona

Add to Reading List

Source URL: www.aclweb.org

Language: English - Date: 2009-03-27 10:36:23
992Non-deterministic pushdown automata Regular languages are recognized by finite automata, context free languages are recognized by non-deterministic pushdown automata.

Non-deterministic pushdown automata Regular languages are recognized by finite automata, context free languages are recognized by non-deterministic pushdown automata.

Add to Reading List

Source URL: www.cs.ox.ac.uk

Language: English - Date: 2012-01-14 04:37:24
993Regular and Irregular Imperfective conjugations in Berber languages

Regular and Irregular Imperfective conjugations in Berber languages

Add to Reading List

Source URL: mlahrouchi.free.fr

Language: English - Date: 2013-05-17 13:45:45
994Stricken language would be deleted from and underlined language would be added to present law. Act 746 of the Regular Session

Stricken language would be deleted from and underlined language would be added to present law. Act 746 of the Regular Session

Add to Reading List

Source URL: www.arkleg.state.ar.us

Language: English - Date: 2013-10-21 14:51:49
995Stricken language would be deleted from and underlined language would be added to present law. Act 767 of the Regular Session 1

Stricken language would be deleted from and underlined language would be added to present law. Act 767 of the Regular Session 1

Add to Reading List

Source URL: www.arkleg.state.ar.us

Language: English - Date: 2013-10-21 14:51:57
996First-past-the-post Games Roland Backhouse [removed]

First-past-the-post Games Roland Backhouse [removed]

Add to Reading List

Source URL: www.cs.nott.ac.uk

Language: English - Date: 2012-04-05 11:06:32
997F Finite State Automata A finite automaton (FA, also called a finite-state automaton or a finite-state machine) is a mathematical tool used to describe processes involving inputs and outputs. An FA can be in one of several states and can switch between states depending

F Finite State Automata A finite automaton (FA, also called a finite-state automaton or a finite-state machine) is a mathematical tool used to describe processes involving inputs and outputs. An FA can be in one of several states and can switch between states depending

Add to Reading List

Source URL: www.davidsalomon.name

Language: English - Date: 2004-09-09 19:53:48
998R. M. McCLUR£, Editor  Regular Expression Search

R. M. McCLUR£, Editor Regular Expression Search

Add to Reading List

Source URL: www.fing.edu.uy

Language: English - Date: 2011-08-19 12:27:48
999FIFTEENTH CONGRESS OF THE REPUBLIC OF THE PHILIPPINES Second Regular Session

FIFTEENTH CONGRESS OF THE REPUBLIC OF THE PHILIPPINES Second Regular Session

Add to Reading List

Source URL: www.senate.gov.ph

Language: English - Date: 2012-05-31 03:53:19
1000Chapter 3 Regular grammars

Chapter 3 Regular grammars

Add to Reading List

Source URL: www.montefiore.ulg.ac.be

Language: English - Date: 2009-09-17 04:30:34